Randomized algorithms

Results: 419



#Item
101Randomized Algorithms 2013A Lecture 12 – Nearest Neighbor Searching (NNS) in High Dimension∗ Robert Krauthgamer Let’s briefly recall our discussion of sketching algorithms. What is Sketching: We have some input x,

Randomized Algorithms 2013A Lecture 12 – Nearest Neighbor Searching (NNS) in High Dimension∗ Robert Krauthgamer Let’s briefly recall our discussion of sketching algorithms. What is Sketching: We have some input x,

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2013-01-28 13:36:00
    102Randomized Algorithms 2013A Lecture 5 – Martingales, Closest Pairs, Hash Tables, Existential Proofs and Codes ∗ Moni Naor The lecture covered quite varied material, starting from Martingales, moving to a linear time

    Randomized Algorithms 2013A Lecture 5 – Martingales, Closest Pairs, Hash Tables, Existential Proofs and Codes ∗ Moni Naor The lecture covered quite varied material, starting from Martingales, moving to a linear time

    Add to Reading List

    Source URL: www.wisdom.weizmann.ac.il

    Language: English - Date: 2012-12-06 01:55:15
      103Chapter 13 Randomized Algorithms Part 1 Slides by Kevin Wayne, modified by Rasmus Pagh.

      Chapter 13 Randomized Algorithms Part 1 Slides by Kevin Wayne, modified by Rasmus Pagh.

      Add to Reading List

      Source URL: itu.dk

      Language: English - Date: 2012-11-07 03:30:04
        104CPS296.2 Geometric Optimization January 23, 2007 Lecture 4: Randomized Algorithms for Linear Programming Lecturer: Pankaj K. Agarwal

        CPS296.2 Geometric Optimization January 23, 2007 Lecture 4: Randomized Algorithms for Linear Programming Lecturer: Pankaj K. Agarwal

        Add to Reading List

        Source URL: www.cs.duke.edu

        Language: English - Date: 2007-02-08 16:45:59
          105Randomized Algorithms 2014/5A Lecture 1 – Min Cut Algorithm, Closest Pairs, (Multi)-Set Equality ∗ Moni Naor The lecture introduced randomized algorithms. Why are they interesting? They may solve problems faster than

          Randomized Algorithms 2014/5A Lecture 1 – Min Cut Algorithm, Closest Pairs, (Multi)-Set Equality ∗ Moni Naor The lecture introduced randomized algorithms. Why are they interesting? They may solve problems faster than

          Add to Reading List

          Source URL: www.wisdom.weizmann.ac.il

          Language: English - Date: 2014-11-18 07:31:28
            106Randomized Algorithms 2013A Lecture 1 – Introduction and Concentration Bounds∗ Robert Krauthgamer 1

            Randomized Algorithms 2013A Lecture 1 – Introduction and Concentration Bounds∗ Robert Krauthgamer 1

            Add to Reading List

            Source URL: www.wisdom.weizmann.ac.il

            Language: English - Date: 2012-11-12 17:25:24
              107Randomized Algorithms 2015A Lecture 9 – Dimension Reduction in ℓ2, Sketching, and NNS in ℓ1∗ Robert Krauthgamer 1

              Randomized Algorithms 2015A Lecture 9 – Dimension Reduction in ℓ2, Sketching, and NNS in ℓ1∗ Robert Krauthgamer 1

              Add to Reading List

              Source URL: www.wisdom.weizmann.ac.il

              Language: English - Date: 2014-12-31 19:10:51
                108Randomized Algorithms 2015A – Problem Set 3 Robert Krauthgamer and Moni Naor Due: January 18, 2015 ∑ 1. Show that the hash function hr : {0, 1}n → {0, 1} mapping x 7→ ni=1 xi ri (mod 2), where ⃗r ∈ {0, 1}n is

                Randomized Algorithms 2015A – Problem Set 3 Robert Krauthgamer and Moni Naor Due: January 18, 2015 ∑ 1. Show that the hash function hr : {0, 1}n → {0, 1} mapping x 7→ ni=1 xi ri (mod 2), where ⃗r ∈ {0, 1}n is

                Add to Reading List

                Source URL: www.wisdom.weizmann.ac.il

                Language: English - Date: 2014-12-31 19:10:51
                  109Randomized Algorithms for Low-Rank Matrix Factorizations: Sharp Performance Bounds Rafi Witten∗ and Emmanuel Cand`es† August 2013; Revised AprilAbstract

                  Randomized Algorithms for Low-Rank Matrix Factorizations: Sharp Performance Bounds Rafi Witten∗ and Emmanuel Cand`es† August 2013; Revised AprilAbstract

                  Add to Reading List

                  Source URL: statweb.stanford.edu

                  Language: English - Date: 2014-04-18 01:52:44
                    110Alea: a library for reasoning on randomized algorithms in Coq Version 7 Christine Paulin-Mohring with contributions by David Baelde and Pierre Courtieu PROVAL Team

                    Alea: a library for reasoning on randomized algorithms in Coq Version 7 Christine Paulin-Mohring with contributions by David Baelde and Pierre Courtieu PROVAL Team

                    Add to Reading List

                    Source URL: www.lri.fr

                    Language: English - Date: 2012-02-12 09:04:39